The 4/5 upper bound on the game total domination number
نویسندگان
چکیده
منابع مشابه
On trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملThe 4/5 upper bound on the game total domination number
The recently introduced total domination game is studied. This game is played on a graph G by two players, named Dominator and Staller. They alternately take turns choosing vertices of G such that each chosen vertex totally dominates at least one vertex not totally dominated by the vertices previously chosen. Dominator’s goal is to totally dominate the graph as fast as possible, and Staller wis...
متن کاملon trees attaining an upper bound on the total domination number
a total dominating set of a graph $g$ is a set $d$ of vertices of $g$ such that every vertex of $g$ has a neighbor in $d$. the total domination number of a graph $g$, denoted by $gamma_t(g)$, is~the minimum cardinality of a total dominating set of $g$. chellali and haynes [total and paired-domination numbers of a tree, akce international ournal of graphs and combinatorics 1 (2004), 6...
متن کاملUpper Bounds on the Total Domination Number
A total dominating set of a graph G with no isolated vertex is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
متن کاملOn Trees Attaining an Upper Bound on the Total Domination Number
A total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γt(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69– 75] established the followin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2016
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-015-3316-3